Essential Matrix Estimation Using Gauss-Newton Iterations on a Manifold
نویسندگان
چکیده
منابع مشابه
Pose Estimation via Gauss-Newton-on-manifold
We present a Gauss-Newton-on-manifold approach for estimating the relative pose (position and orientation) between a 3D object and its projection on a 2D image plane from a set of point correspondences. The pose estimation problem is formulated as an optimization over three rotation parameters on the intersection of the manifold of the rotation matrices and a cone constraint on these matrices t...
متن کاملGauss-newton-on-manifold for Pose Estimation
We consider the task of estimating the relative pose (position and orientation) between a 3D object and its projection on a 2D image plane from a set of point correspondences. Our approach is to formulate the task as an unconstrained optimization problem on the intersection of the special orthogonal group and a cone, and exploit as much as possible the geometry of the underlying parameter space...
متن کاملEssential Matrix Estimation via Newton-type Methods
In this paper camera parameters are assumed to be known and a novel approach for essential matrix estimation is presented. We estimate the essential matrix from point correspondences between a stereo image pair. The technical approach we take is a generalization of the classical Newton method. It is well-known that the set of essential matrices forms a smooth manifold. Moreover, it is quite nat...
متن کاملMotion Estimation on the Essential Manifold
We introduce a novel perspective for viewing the \ego-motion reconstruction" problem as the estimation of the state of a dynamical system having an implicit measurement constraint and unknown inputs. Such a system happens to be \linear", but it is deened on a space (the \Essential Manifold") which is not a linear (vector) space. We propose two recursive schemes for performing the estimation tas...
متن کاملPhaseless Recovery Using the Gauss-Newton Method
Abstract. In this paper, we develop a concrete algorithm for phase retrieval, which we refer to as GaussNewton algorithm. In short, this algorithm starts with a good initial estimation, which is obtained by a modified spectral method, and then update the iteration point by a Gauss-Newton iteration step. We prove that a re-sampled version of this algorithm quadratically converges to the solution...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Vision
سال: 2007
ISSN: 0920-5691,1573-1405
DOI: 10.1007/s11263-006-0005-0